Combinatorial laplacians and positivity under partial transpose
نویسندگان
چکیده
ROLAND HILDEBRAND†, STEFANO MANCINI‡ and S IMONE SEVERINI§¶ †LJK Université Joseph Fourier, Tour IRMA, 51 rue des Mathématiques, 38400 St. Martin d’Hères, France ‡Dipartimento di Fisica, Università di Camerino, Via Madonna delle Carceri 9, 62032 Camerino, Italy §Department of Computer Science, University of York, Heslington, Y010 5DD York, United Kingdom ¶Current address: Institute for Quantum Computing, University of Waterloo, 200 University Avenue, N2L 3G1 Waterloo, Canada
منابع مشابه
0 Ju l 2 00 6 Combinatorial Laplacians and Positivity Under Partial Transpose
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein et al. Phys. Rev. A, 73:1, 012320 (2006)). This work deals with properties of density matrices of graphs and indicates some venues for future research in this subject. Namely, we prove that the condition called degree-criterion, which was conjectured to be necessary and sufficient for separability o...
متن کاملN ov 2 00 6 Combinatorial Laplacians and Positivity Under Partial Transpose
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein et al. Phys. Rev. A, 73:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix carries a block structure with respect to which properties such as separability can be considered. We prove that the so-called degree-criterion, which was conjectured to be necessa...
متن کاملDistillability via protocols respecting the positivity of partial transpose.
We show that all quantum states that do not have a positive partial transpose are distillable via channels, which preserve the positivity of the partial transpose. The question whether bound entangled states with non-positive partial transpose exist is therefore closely related to the connection between the set of separable superoperators and positive partial transpose-preserving maps.
متن کاملPartial Transpose of Permutation Matrices
The main purpose of this paper is to look at the notion of partial transpose from the combinatorial side. In this perspective, we solve some basic enumeration problems involving partial transpose of permutation matrices. Specifically, we count the number of permutations matrices which are invariant under partial transpose. We count the number of permutation matrices which are still permutation ...
متن کاملPartial Transposes of Permutation Matrices
The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of the partial transpose from a combinatorial point of view. In this perspective, we solve some basic enumeration problems concerning the partial transpose of permutation matrices. More specifically, we count the number of permutations matrices which are invarian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 18 شماره
صفحات -
تاریخ انتشار 2008